Summarizing biological literature with BioSumm.

Support driven opportunistic aggregation for generalized itemset extraction.

Array%2DTree A persistent data structure to compactly store frequent itemsets.



A persistent HY%2DTree to efficiently support itemset mining on large datasets.

Constrained itemset mining on a sequence of incoming data blocks.

NetCluster A Clustering%2DBased Framework for Internet Tomography.
Abstract — In this paper, Internet data collected via passive measurement are analyzed to obtain localization information on nodes by clustering (i.e., grouping together) nodes that exhibit similar network path properties. Since traditional clustering algorithms fail to correctly identify clusters of homogeneous nodes, we propose a novel framework, named “NetCluster”, suited to analyze Internet measurement datasets. We show that the proposed framework correctly analyzes synthetically generated traces. Finally, we apply it to real traces collected at the access link of our campus LAN and discuss the network characteristics as seen at the vantage point. I. INTRODUCTION AND MOTIVATIONS The Internet is a complex distributed system which continues to grow and evolve. The unregulated and heterogeneous structure of the current Internet makes it challenging to obtain
Context%2DAware User and Service Profiling by Means of Generalized Association Rules.



Extraction of Constraints from Biological Data.

Characterizing network traffic by means of the NetMine framework.

IMine Index Support for Item Set Mining.

Real%2DTime Analysis of Physiological Data to Support Medical Applications.

BioSumm A novel summarizer oriented to biological information.

Exploring Heterogeneous Biological Data Sources.

Generalized association rules to support Network Digest analysis.

Compact Representations of Sequential Classification Rules.

Applying sequential rules to protein localization prediction.

A Lazy Approach to Associative Classification.

Gene%2DMarkers Representation for Microarray Data Integration.

SAPhyRA Stream Analysis for Physiological Risk Assessment.

Modeling a Sensor Network by means of Clustering.

Topic 5 Parallel and Distributed Databases.

Answering XML queries by means of data summaries.

Associative text categorization exploiting negated words.

Selecting Representatives in a Sensor Network.

Data Cleaning and Semantic Improvement in Biological Databases.

Data mining techniques for effective and scalable traffic analysis.

Index Support for Frequent Itemset Mining in a Relational DBMS.

Data mining techniques for effective and scalable traffic analysis.

Index Support for Mining Data Streams in a Relational DBMS.

Index Support for Mining Data Streams in a Relational DBMS.

Summarizing XML Data by Means of Association Rules.

On support thresholds in associative classification.

Frequent Itemset Mining in a Relational DBMS.

Answering Queries on XML Data by means of Association Rules.

Essential classification rule sets.
Abstract—This paper studies a problem of robust rule-based classification, i.e., making predictions in the presence of missing values in data. This study differs from other missing value handling research in that it does not handle missing values but builds a rule-based classification model to tolerate missing values. Based on a commonly used rule-based classification model, we characterize the robustness of a hierarchy of rule sets as k-optimal rule sets with the decreasing size corresponding to the decreasing robustness. We build classifiers based on k-optimal rule sets and show experimentally that they are more robust than some benchmark rule-based classifiers, such as C4.5rules and CBA. We also show that the proposed approach is better than two well-known missing value handling methods for missing values in test data. Index Terms—Data mining, rule, classification, robustness. 1
Towards Feasible Topology Formation Algorithms for Bluetooth%2Dbased WPANs.
In this paper, we tackle the problem of topology formation in Bluetooth Wireless Personal Area Networks (BT-WPANs). We first overview and extend a previously proposed centralized optimization approach, and discuss its results. Then we outline the main steps of two procedures that can lead to feasible distributed algorithms for the incremental construction of the topology of a BT-WPAN. The centralized optimization approach has the advantage of producing topologies that minimize the traffic load of the most congested node in the network (thus also minimizing energy consumption) while meeting the constraints on the BT-WPAN structure and capacity. However, the centralized nature and the high complexity of the optimization are a strong limitation of the proposed approach. Distributed algorithms for the topology formation of BT-WPANs are much more attractive, provided their algorithmic complexity and energy cost are sufficiently low to allow implementation in large BT-WPANs. We discuss distributed procedures for the insertion and the removal of a node in/from a BT-WPAN, which are easily implementable and able to compromise between the system efficiency and its ability to promptly recover from topology changes. These procedures are the key building blocks for a distributed solution approach to the BT-WPAN topology formation problem. 1
Materialized Viewsin Multidimensional Databases.

Majority Classification by Means of Association Rules.

Materialized Viewsin Multidimensional Databases.

A Lazy Approach to Pruning Classification Rules.

Accurate Classification by means of Association Rules.


An algebraic approach to static analysis of active database rules.
ing with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works, requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept, ACM Inc., 1515 Broadway, New York, NY 10036 USA, fax +1 (212) 869-0481, or permissions@acm.org. This is a preliminary release of an article accepted by ACM Transactions on Database Systems. The definitive version is currently in production at ACM and, when released, will supersede this version.  2 \Delta E. Baralis and J. Widom  1. INTRODUCTION  An active database system is a conventional database system extended with a facility for managing active rules (or triggers). Incorporating active rules into a conventional database system has raised considerable interest both in the scientific community and in the commercial world: A number of prototypes that incorporate active rules into relational and object-oriented database system...

Data Mining in Data Warehouses.
Izkopavanje znanja in podatkovna skladišča Tehnologije, ki se ukvarjajo s podatki so v zadnjem desetletju (devetdeseta leta) močno napredovale. Iz prve faze, kjer je šlo predvsem zato kako podatke shraniti in kako do njih učinkovito dostopati, se je razvila industrija za izdelavo orodij za delo s podatkovnimi bazami, prišlo je do standardizacije procesov, povpraševalnih jezikov itd. Ko shranjevanje podatkov ni bil več poseben problem se je pojavila potreba po bolj urejenih podatkovnih bazah, ki bi služile ne le transakcijskem procesiranju ampak tudi bolj analitskim pogledom v podatke – pojavilo se je skladiščenje podatkov (data warehousing), ki postaja vse bolj standarden del informacijskih sistemov v podjetjih. Paradigma OLAP (On-Line-Analytical-Processing) zahteva od uporabnika, da še vedno sam postavlja sistemu vprašanja in dobiva nanje odgovore in na vizualen način preverja in išče izstopajoče situacije. Ker seveda to vedno ni mogoče, se je pojavila potreba po avtomatski analizi teh podatkov oz. z drugimi besedami to, da tehnologija sama pove, kaj bi utegnilo biti zanimivo za človeka – to prinašajo
Data Mining in Data Warehouses.
Izkopavanje znanja in podatkovna skladišča Tehnologije, ki se ukvarjajo s podatki so v zadnjem desetletju (devetdeseta leta) močno napredovale. Iz prve faze, kjer je šlo predvsem zato kako podatke shraniti in kako do njih učinkovito dostopati, se je razvila industrija za izdelavo orodij za delo s podatkovnimi bazami, prišlo je do standardizacije procesov, povpraševalnih jezikov itd. Ko shranjevanje podatkov ni bil več poseben problem se je pojavila potreba po bolj urejenih podatkovnih bazah, ki bi služile ne le transakcijskem procesiranju ampak tudi bolj analitskim pogledom v podatke – pojavilo se je skladiščenje podatkov (data warehousing), ki postaja vse bolj standarden del informacijskih sistemov v podjetjih. Paradigma OLAP (On-Line-Analytical-Processing) zahteva od uporabnika, da še vedno sam postavlja sistemu vprašanja in dobiva nanje odgovore in na vizualen način preverja in išče izstopajoče situacije. Ker seveda to vedno ni mogoče, se je pojavila potreba po avtomatski analizi teh podatkov oz. z drugimi besedami to, da tehnologija sama pove, kaj bi utegnilo biti zanimivo za človeka – to prinašajo
Rule Analysis
Abstract- In this paper, we propose a method to analyze the firewall policy or rule-set using Relational Algebra and Raining 2D-Box Model. It can discover all the anomalies in the firewall rule-set in the format that is usually used by many firewall products such as Cisco Access Control List, IPTABLES, IPCHAINS and Check Point Firewall-1. While the existing analyzing methods consider the anomalies between any two rules in the firewall rule-set, we consider more than two rules together at the same time to discover the anomaly. Therefore we can find all the hidden anomalies in the firewall rule-set. Results from analyzing can be used with the proposed rules-combination method presented in this paper, to minimize the firewall rule without changing the policy. Finally, we have developed an application based on the proposed analyzing method. This application could help administrator to analyze and modify a complex firewall policy with less error.
Incremental Refinement of Association Rule Mining.

Compile%2DTime and Runtime Analysis of Active Behaviors.

Performance Evaluation of Rule Semantics in Active Databases.

Amore An Integrated Environment for Database Mining.

Materialized Views Selection in a Multidimensional Database.
A multidimensional database is a data repository that supports the efficient execution of complex business decision queries. Query response can be significantly improved by storing an appropriate set of materialized views. These views are selected from the multidimensional lattice whose elements represent the solution space of the problem. Several techniques have been proposed in the past to perform the selection of materialized views for databases with a reduced number of dimensions. When the number and complexity of dimensions increase, the proposed techniques do not scale well. The technique we are proposing reduces the solution space by considering only the relevant elements of the multidimensional lattice. An additional statistical analysis allows a further reduction of the solution space.  1 Introduction  A multidimensional database (MDDB) is a data repository that provides an integrated environment for decision support queries that require complex aggregations on huge amounts of...
Designing Templates for Mining Association Rules.

Debugging and Run%2Dtime Monitoring of Active Rules.

Conservative Timestamp Revisited for Materialized View Maintenance in a Data Warehouse.

Modularization Techniques for Active Rules Design.

Support Environment for Active Rule Design.

Design of Active Rule Applications Issues and Approaches.

Run%2Dtime Detection of Non%2DTerminating Active Rule Systems.

Using Delta Relations to Optimize Condition Evaluation in Active Databases.
. We give a method for improving the efficiency of condition evaluation during rule processing in active database systems. The method derives, from a rule condition, two new conditions that can be used in place of the original condition when a previous value (true or false) of the original condition is known. The derived conditions are generally more efficient to evaluate than the original condition because they are incremental---they replace references to entire database relations by references to delta relations, which typically are much smaller. Delta relations are accessible to rule conditions in almost all current active database systems, making this optimization broadly applicable. We describe an attribute grammar based approach that we have used to implement our condition rewriting technique. 1 Introduction  Active database systems allow users to specify event-condition-action rules that are processed automatically by the database system in response to data manipulation by users...
Improving Rule Analysis by Means of Triggering and Activation Graphs.

Using Delta Relations to Optimize Condition Evaluation in Active Databases.
. We give a method for improving the efficiency of condition evaluation during rule processing in active database systems. The method derives, from a rule condition, two new conditions that can be used in place of the original condition when a previous value (true or false) of the original condition is known. The derived conditions are generally more efficient to evaluate than the original condition because they are incremental---they replace references to entire database relations by references to delta relations, which typically are much smaller. Delta relations are accessible to rule conditions in almost all current active database systems, making this optimization broadly applicable. We describe an attribute grammar based approach that we have used to implement our condition rewriting technique. 1 Introduction  Active database systems allow users to specify event-condition-action rules that are processed automatically by the database system in response to data manipulation by users...
An Intelligent Database System Application The Design of EMS.

Declarative Specification of Constraint Maintenance.

An Algebraic Approach to Rule Analysis in Expert Database Systems.
Expert database systems extend the functionality of conventional database systems by providing a facility for creating and automatically executing Condition-Action rules. While Condition-Action rules in database systems are very powerful, they also can be very difficult to program, due to the unstructured and unpredictable nature of rule processing. We provide methods for static analysis of Condition-Action rules; our methods determine whether a given rule set is guaranteed to terminate, and whether rule execution is confluent (has a guaranteed unique final state). Our methods are based on previous methods for analyzing rules in active database systems. We improve considerably on the previous methods by providing analysis criteria that are much less conservative: our methods often determine that a rule set will terminate or is confluent when previous methods could not. Our improved analysis is based on a &#034;propagation&#034; algorithm, which uses a formal approach based on an extended relatio...
Better Termination Analysis for Active Databases.

